Grammatical Evolution: Evolving Programs for an Arbitrary Language
نویسندگان
چکیده
We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar deenition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.
منابع مشابه
Evolving Multi-line Compilable C Programs
We describe a Genetic Algorithm called Grammatical Evolution (GE) that can evolve complete programs in an arbitrary language using a variable length linear genome. The binary genome determines which production rules in a Backus Naur Form grammar deenition are used in a genotype to phenotype mapping process to a program. Expressions and programs of arbitrary complexity may be evolved using this ...
متن کاملEvolving Intrusion Detection Rules on Mobile Ad Hoc Networks
Intrusion detection on mobile Ad Hoc Networks (MANETs) is in its early stages. In this paper, we show how grammatical evolution can be used to evolve detection programs for dropping attacks, a particularly important attack type for such networks.
متن کاملAutomatic Generation of Caching Algorithms
Grammatical Evolution (GE) is a grammar based GA to generate computer programs which has been shown to be comparable with GP when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate programs in any language, of arbitrary complexity, including loops, multiple line functions etc. Part of the power of GE is that it is closer to natur...
متن کاملGrammatical Evolution: A Steady State approach
We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern the mapping of a Backus Naur Form grammar definition to a program, expressions and programs of arbitrary complexity may be evolved. Our system, Grammatical Evolution, has been applied to problems such as a Symbolic Regression problem, and finding Trigonometric Identities. In this p...
متن کاملAutomatic Generation of Programs with Grammatical Evolution
Grammatical Evolution (GE) is a grammar based Evolutionary Algorithm to generate computer programs which has been shown to be competitive with Genetic Programming when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate arbitrarily complex programs in any language, including loops, multiple line functions etc. Part of the power of...
متن کامل